Combinatorial and experimental results for randomized point matching algorithms
نویسندگان
چکیده
منابع مشابه
Experimental Results on String Matching Algorithms
We present experimental results for string matching algorithms which are known to be fast in practice. We compare these algorithms through two aspects: the number of text character inspections and the running time. These experiments show that for large alphabets and small patterns the Quick Search algorithm of Sunday is the most efficient and that for small alphabets and large patterns it is th...
متن کاملExperimental Results on Multiple Pattern Matching Algorithms for Biological Sequences
With the remarkable increase in the number of DNA and proteins sequences, it is very important to study the performance of multiple pattern matching algorithms when querying sequence patterns in biological sequence databases. In this paper, we present a performance study of the running time of well known multiple pattern matching algorithms on widely used biological sequence databases containin...
متن کاملOn-line string matching algorithms: survey and experimental results
In this paper we present a short survey and experimental results for well known sequential string matching algorithms. We consider algorithms based on different approaches including classical, suffix automata, bit-parallelism and hashing. We put special emphasis on algorithms recently presented such as Shift-Or and BNDM algorithms. We compare these algorithms in terms of the number of character...
متن کاملRandomized Parallel Algorithms for Combinatorial Optimization
In this paper we show some important randomization techniques for the parallel processing of discrete problems. In particular, we present several parallel randomized algorithms frequently used for sorting, packet routing, shortest paths problems, matching problems, depth rst search, minimum cost spanning trees, and maximal independent set problems. We also discuss the connection between randomi...
متن کاملMatching points with geometric objects: Combinatorial results
Given a class C of geometric objects and a point set P , a Cmatching of P is a set M = {C1, . . . , Ck} of elements of C such that every Ci contains exactly two elements of P . If all the elements of P belong to some Ci, M is called a perfect matching ; if in addition all the elements of M are pairwise disjoint we say that this matching M is strong. In this paper we study the existence and char...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1999
ISSN: 0925-7721
DOI: 10.1016/s0925-7721(98)00033-9